Affine Invariant 3L Fitting of Implicit Polynomials
نویسنده
چکیده
Combining implicit polynomials and algebraic invariants for representing and recognizing complicated objects proves to be a powerful technique. However, a basic requirement for using implicit polynomials for affine invariant recognition is to have an affine invariant fitting algorithm. In this paper, we study the problem of affine invariant fitting of an implicit polynomial to data. Received January 17, 200 1
منابع مشابه
Robust Fitting of Implicit Polynomials with Quantized Coefficients to 2D Data
This work presents a new approach to contour representation and coding. It consists of an improved fitting of high-degree (4 to 18) implicit polynomials (IPs) to the contour, which is robust to coefficient quantization. The proposed approach to solve the fitting problem is a modification of the 3L linear solution developed by Lei et al and is more robust to noise and to coefficient quantization...
متن کامل3L fitting of higher degree implicit polynomials
Implicit polynomial 2D curves and 3D surfaces are potentially among the most useful object or data representations for use in computer vision and image analysis. That is because of their interpolation property, Euclidean and aane invariants, and Bayesian recog-nizers. This paper studys and compares various tting algorithms in a uniied framework of stability analysis. It presents a new robust 3L...
متن کاملIRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Recognition of 3D Objects Based on Implicit Polynomials
This work deals with 3D objects description and recognition by implicit polynomials (IPs). We explore the description abilities of existing 3D implicit polynomials fitting algorithms, Gradient-One, Min-Max and Min-Var, and suggest a modification for the Min-Max and Min-Var algorithms, so that they will be rotation invariant. We develop a new set of 3D rotation invariants that are linear combina...
متن کاملIRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES 2D Object Description and Recognition Based on Contour Matching by Implicit Polynomials
This work deals with 2D object description and recognition based on coefficients of implicit polynomials (IP). We first improve the description abilities of recently published Min-Max and Min-Var algorithms by replacing algebraic distances by geometric ones in the relevant cost function. We show that a recognizer based on a full set of recently published linear, quadrature, and angular rotation...
متن کاملA New Affine Invariant Fitting Algorithm for Algebraic Curves
In this paper, we preseni a new affine invariant curve fitting technique. Our method is based on the affine invariant Fourler descrlptors and implicitization of them by matrix annihilation. Experlmental results are presented to assess the stability and robustness of our fitting method under data perturba'tions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003